Preconditioning of wavelet BEM by the incomplete Cholesky factorization
نویسنده
چکیده
The present paper is dedicated to the preconditioning of boundary element matrices in wavelet coordinates. We investigate the incomplete Cholesky factorization for a pattern which includes also the coefficients of all off-diagonal bands associated with the level-level-interactions. The pattern is chosen in such a way that the incomplete Cholesky factorization is computable in log-linear complexity. Numerical experiments are performed to quantify the effects of the proposed preconditioning.
منابع مشابه
A Hybrid Parallel Preconditioner Using Incomplete Cholesky Factorization and Sparse Approximate Inversion
We have recently developed a preconditioning scheme that can be viewed as a hybrid of incomplete factorization and sparse approximate inversion methods. This hybrid scheme attempts to deliver the strengths of both types of preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) on multiprocessors. We provide an overview of our algorithm and report on initial results fo...
متن کاملNon-orthogonal spline wavelets for boundary element analysis
Non-orthogonal spline wavelets are developed for Galerkin BEM. The proposed wavelets have compact supports and closed-form expressions. Besides of it, one can choose arbitrarily the order of vanishing moments of the wavelets independently of order of B-splines. Sparse coefficient matrices are obtained by truncating the small elements a priori. The memory requirement and computational time can b...
متن کاملA latency tolerant hybrid sparse solver using incomplete Cholesky factorization
Consider the solution of large sparse symmetric positive de nite linear systems using the preconditioned conjugate gradient method. On sequential architectures, incomplete Cholesky factorizations provide effective preconditioning for systems from a variety of application domains, some of which may have widely di ering preconditioning requirements. However, incomplete factorization based precond...
متن کاملA latency tolerant hybrid sparse solver using incomplete Cholesky factorization 3
Consider the solution of large sparse symmetric positive de nite linear systems using the preconditioned conjugate gradient method. On sequential architectures, incomplete Cholesky factorizations provide ef13 fective preconditioning for systems from a variety of application domains, some of which may have widely di ering preconditioning requirements. However, incomplete factorization based prec...
متن کاملParallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for constructing and applying preconditioners on multiprocessors using incomplete factorizations with selective inversion for improved latency-tolerance. We provide empirical results on the efficiency, scalability and quality of our precond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computat. and Visualiz. in Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2012